- eigenvalue method
- метод собственных значений
Авиасловарь. М.А.Левин. 2004.
Авиасловарь. М.А.Левин. 2004.
Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… … Wikipedia
Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… … Wikipedia
Jacobi eigenvalue algorithm — The Jacobi eigenvalue algorithm is a numerical procedure for the calculation of all eigenvalues and eigenvectors of a real symmetric matrix. Description Let varphi in mathbb{R}, , 1 le k < l le n and let J(varphi, k, l) denote the n imes n matrix … Wikipedia
Divide-and-conquer eigenvalue algorithm — Divide and conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such… … Wikipedia
GF method — Wilson s GF method, sometimes referred to as FG method, is a classical mechanical method to obtain certain internal coordinates fora vibrating semi rigid molecule, the so called normal coordinates Q k. Normal coordinates decouple the classical… … Wikipedia
Hückel method — The Hückel method or Hückel molecular orbital method (HMO) proposed by Erich Hückel in 1930, is a very simple linear combination of atomic orbitals molecular orbitals (LCAO MO) method for the determination of energies of molecular orbitals of pi… … Wikipedia
Ritz method — In physics, the Ritz method is a variational method named after Walter Ritz.In quantum mechanics, a system of particles can be described in terms of an energy functional or Hamiltonian, which will measure the energy of any proposed configuration… … Wikipedia
Quadratic eigenvalue problem — In mathematics, the quadratic eigenvalue problem [F. Tisseur and K. Meerbergen, The quadratic eigenvalue problem, SIAMRev., 43 (2001), pp. 235–286.] (QEP) , is to find scalar eigenvalues lambda,, left eigenvectors y, and right eigenvectors x,… … Wikipedia
Folded spectrum method — In mathematics, the folded spectrum method (FSM) is a iterative method for solving large eigenvalue problems.Here you always find a vector with an eigenvalue close to a search value varepsilon. This means you can get a vector Psi in the middle of … Wikipedia
Conjugate gradient method — A comparison of the convergence of gradient descent with optimal step size (in green) and conjugate vector (in red) for minimizing a quadratic function associated with a given linear system. Conjugate gradient, assuming exact arithmetic,… … Wikipedia
Multigrid method — Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not… … Wikipedia